﻿#include "Sort.h"

//测试直接插入排序
void test1()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	printf("直接插入排序前>:");
	PrintArr(arr, sz);
	InsertSort(arr, sz);//直接插入排序
	printf("直接插入排序后>:");
	PrintArr(arr, sz);
}
//测试希尔排序
void test2()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	printf("希尔排序前>:");
	PrintArr(arr, sz);
	ShellSort(arr, sz);//希尔排序
	printf("希尔排序后>:");
	PrintArr(arr, sz);
}
//测试冒泡排序
void test3()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	printf("冒泡排序前>:");
	PrintArr(arr, sz);
	BubbleSort(arr, sz);//冒泡排序
	printf("冒泡排序后>:");
	PrintArr(arr, sz);
}
//测试堆排序
void test4()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	printf("堆排序前>:");
	PrintArr(arr, sz);
	HeapSort(arr, sz);//堆排序
	printf("堆排序后>:");
	PrintArr(arr, sz);
}
//测试直接选择排序
void test5()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	printf("直接选择排序前>:");
	PrintArr(arr, sz);
	SelectSort(arr, sz);//堆排序
	printf("直接选择排序后>:");
	PrintArr(arr, sz);
}
//测试快速排序---递归版本
void test6()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	printf("快速排序前>:");
	PrintArr(arr, sz);
	QuickSort(arr, 0, sz - 1);//快速排序
	printf("快速排序后>:");
	PrintArr(arr, sz);
}
//测试快速排序---非递归版本
void test7()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	printf("快速排序前>:");
	PrintArr(arr, sz);
	QuickSortNone(arr, 0, sz - 1);//快速排序
	printf("快速排序后>:");
	PrintArr(arr, sz);
}

//测试归并排序
void test8()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	printf("归并排序前>:");
	PrintArr(arr, sz);
	MergeSort(arr, sz);//归并排序
	printf("归并排序后>:");
	PrintArr(arr, sz);
}
//测试计数排序
void test9()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	printf("计数排序前>:");
	PrintArr(arr, sz);
	CountSort(arr, sz);//计数排序
	printf("计数排序后>:");
	PrintArr(arr, sz);
}


//测试排序的性能对⽐
void TestOP()
{
	srand(time(0));
	const int N = 100000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
	}
	int begin1 = clock();
	InsertSort(a1, N);
	int end1 = clock();
	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();
	int begin3 = clock();
	SelectSort(a3, N);
	int end3 = clock();
	int begin4 = clock();
	HeapSort(a4, N);
	int end4 = clock();
	int begin5 = clock();
	QuickSort(a5, 0, N - 1);
	int end5 = clock();
	int begin6 = clock();
	MergeSort(a6, N);
	int end6 = clock();
	int begin7 = clock();
	BubbleSort(a7, N);
	int end7 = clock();
	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	printf("BubbleSort:%d\n", end7 - begin7);
	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
}
int main()
{
	//test1();
	//test2();
	//test3();
	//test4();
	//test5();
	//test6();
	//test7();
	//test8();
	//test9();

	TestOP();//测试排序算法性能
	return 0;
}